منابع مشابه
Almost All Palindromes Are Composite
We study the distribution of palindromic numbers (with respect to a fixed base g ≥ 2) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes n ≤ x as x → ∞. Our results show that almost all palindromes in a given base are composite. ∗MSC Numbers: 11A63, 11L07, 11N69 †Corresponding author 1
متن کاملM ay 2 00 4 Almost All Palindromes Are Composite ∗
We study the distribution of palindromic numbers (with respect to a fixed base g ≥ 2) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes n ≤ x as x → ∞. Our results show that almost all palindromes in a given base are composite.
متن کاملAlmost All Complex Quantifiers Are Simple
We prove that PTIME generalized quantifiers are closed under Boolean operations, iteration, cumulation and resumption.
متن کاملAlmost all webs are not rank-perfect
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [9]. Ben Rebea conjectured a description for quasi-line graphs, see [12]; Chudnovsky and Seymour [2] v...
متن کاملWhen almost all sets are difference dominated
We investigate the relationship between the sizes of the sum and difference sets attached to a subset of {0, 1, ..., N}, chosen randomly according to a binomial model with parameter p(N), with N = o(p(N)). We show that the random subset is almost surely difference dominated, as N → ∞, for any choice of p(N) tending to zero, thus confirming a conjecture of Martin and O’Bryant. Furthermore, we ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Research Letters
سال: 2004
ISSN: 1073-2780,1945-001X
DOI: 10.4310/mrl.2004.v11.n6.a10